15,665 research outputs found

    The development of modern Chinese banking

    Full text link
    Thesis (M.A.)--Boston UniversityThis study purports to evaluate the relationship between the Chinese modern banking system and the activities or the national economy and to describe the significance of its development on China's peace and war economy. The problem is to be approached by tracing the formation of banking institutions and developments, by investigating the internal organization and practices and by analyzing the influence of Government financial policies. It covers the period from the appearance of the first Chinese-owned modern bank in 1897 to the New Monetary Reform in 1948. The meagerness of data necessarily renders this study far from being complete; the most significant characteristics of the development, however, are to be considered

    On Martin's Pointed Tree Theorem

    Full text link
    We investigate the reverse mathematics strength of Martin's pointed tree theorem (MPT) and one of its variants, weak Martin's pointed tree theorem (wMPT)

    Rigidity for F_4(p)

    Full text link
    We prove the existence of certain rationally rigid triples in F_4(p) for good primes p (i.e., p>3), thereby showing that these groups occur as regular Galois groups over Q(t) and so also over Q. We show that these triples give rise to rigid triples in the algebraic group and prove that they generate an interesting subgroup in characteristic 0.Comment: 9 pages. Welcome comment

    Quantum Algorithm for Approximating Maximum Independent Sets

    Full text link
    We present a quantum algorithm for approximating maximum independent sets of a graph based on quantum non-Abelian adiabatic mixing in the sub-Hilbert space of degenerate ground states, which generates quantum annealing in a secondary Hamiltonian. For both sparse and dense graphs, our quantum algorithm on average can find an independent set of size very close to α(G)\alpha(G), which is the size of the maximum independent set of a given graph GG. Numerical results indicate that an O(n2)O(n^2) time complexity quantum algorithm is sufficient for finding an independent set of size (1−ϵ)α(G)(1-\epsilon)\alpha(G). The best classical approximation algorithm can produce in polynomial time an independent set of size about half of α(G)\alpha(G)

    Detection of Symmetry Enriched Topological Phases

    Full text link
    Topologically ordered systems in the presence of symmetries can exhibit new structures which are referred to as symmetry enriched topological (SET) phases. We introduce simple methods to detect the SET order directly from a complete set of topologically degenerate ground state wave functions. In particular, we first show how to directly determine the characteristic symmetry fractionalization of the quasiparticles from the reduced density matrix of the minimally entangled states. Second, we show how a simple generalization of a non-local order parameter can be measured to detect SETs. The usefulness of the proposed approached is demonstrated by examining two concrete model states which exhibit SET: (i) a spin-1 model on the honeycomb lattice and (ii) the resonating valence bond state on a kagome lattice. We conclude that the spin-1 model and the RVB state are in the same SET phases
    • …
    corecore